Comparative Survey on Load Balancing Techniques in Computational Grids

نویسنده

  • R. Rajeswari
چکیده

Grid is the system which provides a new, powerful and innovative platform that caters the need of massively computational or data intensive applications from its pool of resources like processors, memory, data, services etc. It differs from traditional computing systems because of its heterogeneous nature and back ground workloads. Performance and utilization of the grid rests on the optimal balancing of load among the available nodes which is very complex and highly dynamic in nature. Finding optimal solution in load balancing for such an environment using the traditional method is an NP-hard problem whereas heuristic approaches will provide near optimal solutions. Algorithms that could capture the dynamic need and complexity have to be developed for solving wide range of load balancing scenarios. Heuristic and artificial life techniques have the power of providing near by solutions from large search spaces since it deals real world scenarios with the capability of handling very large dataset and combinations. In this study, suitability and performance comparison are discussed with various heuristic and agent based techniques. Genetic Algorithm, Tabu Search, Ant Colony Optimization, Particle swarm Optimization are analyzed with their merits, demerits, solutions, issues and improvements towards load balancing in computational grid. Similarity in their nature towards load balancing motivates the attempts in the experimentation to get near optimal solutions from unpredictable information. Performance comparison is analyzed with algorithms like min-max, max-min and Sufferage embedded with Genetic Algorithm and Tabu search. Another heuristic method, Ant Colony Optimization algorithm is suitable for scheduling in grid environment which in tern balances the load. For the same purpose particle swarm optimization algorithm is also adopted. Particle Swarm Optimization is one of the latest evolutionary optimization techniques by nature which has the better ability of global searching leading to minimal makespan time due to the linear decreasing of inertia weight in it. From the literature, it could be understood that it was successfully applied in training the neural network and optimized result was been obtained. These techniques were studied with their successful results and analyzed. Agents can also be applied for handling grid resources and multi-agent approach can be applied for balancing the load through out the system. Agents can co-operate each other in making the decisions to balance the load among them through advertisement, discovery and distribution. Many results are proving that intelligent agents are effective enough to achieve resource scheduling, load balancing, execution performance and better resource utilization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource Discovery Techniques in Distributed Desktop Grid Environments

Desktop grids use opportunistic sharing to exploit large collections of personal computers and workstations across the Internet, achieving tremendous computing power at low cost. Traditional desktop grid systems are typically based on a clientserver architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. In this paper, we propose a decentralized, r...

متن کامل

A Load Balancing in Grid Environment

Grid computing is being adopted in various areas from academic, industry research to government use. Grids are becoming platforms for high performance and distributed computing. The computational grid is a new parallel and distributed computing paradigm that provides resources for large scientific computing applications. Many researchers have been proposed numerous scheduling and load balancing...

متن کامل

Artificial life techniques for load balancing in computational grids

Load balancing is a very important and complex problem in computational grids. A computational grid differs from traditional high performance computing systems in the heterogeneity of the computing nodes and communication links, as well as background workloads that may be present in the computing nodes. There is a need to develop algorithms that could capture this complexity yet can be easily i...

متن کامل

Parleda: a Library for Parallel Processing in Computational Geometry Applications

ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...

متن کامل

A Load Balancing Policy for Heterogeneous Computational Grids

Computational grids have the potential computing power for solving large-scale scientific computing applications. To improve the global throughput of these applications, workload has to be evenly distributed among the available computational resources in the grid environment. This paper addresses the problem of scheduling and load balancing in heterogeneous computational grids. We proposed a tw...

متن کامل

Parallelizing Sparse Grid Volume Visualization with Implicit Preview and Load Balancing

New algorithms that work entirely on sparse grids can create data sets that cannot be handled on uniform grids any more due to their size. On the other hand, most visualization techniques are only capable of handling uniform grids. As the interpolation on sparse grids is a complicated and time consuming process, direct volume visualization is unthinkable for bigger data sets until the underlyin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013